Clos Networks: A correction of the Jacobaeus result

نویسنده

  • Claude Rigault
چکیده

In 1950, C. Jacobaeus of LM Ericsson established a method for computing internal blocking probabilities for a point-to-point selection within an interconnection network. Jacobaeus result showed that a three stage network would be "nearly" free of internal blocking if the number of matrices in the second stage was equal to the number of inlets of a first stage matrix plus the number of outlets of a third stage matrix minus one. In 1953, C. Clos of Bell Labs showed that for such a number of second stage matrices referred as the "Clos number" the internal blocking probability should indeed be exactly zero under any traffic hypothesis. This meant that the Jacobaeus result, although quite precise, was not perfectly exact. In this paper we bring a correction to the Jacobaeus calculation, leading to a different result. This new result gives an exact zero internal blocking probability for a number of second stage matrices equal to the "Clos result" showing thus its better accuracy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation of a Mesh of Clos Wormhole Network

Wiring constraints often result in a trade-off between efficiency and realizability when designing communication networks for multicomputers. By combining the connectivity of multistage networks with the easy to realize mesh networks, the Mesh of Clos topology tries to narrow this gap. In this paper, a simulation study is presented in order to evaluate wormhole routed Mesh of Clos communication...

متن کامل

Evaluation of a Mesh of Clos wormhole network

The pursuit of high connectivity in network design for multicomputers is often complicated by wiring constraints, resulting in a trade-off between efficiency and realizability. The Mesh of Clos topology addresses this trade-off by combining a multistage network with a mesh network. In this paper, a simulation study is presented in order to evaluate wormhole-routed Mesh of Clos communication net...

متن کامل

Routing of asynchronous Clos networks

Clos networks provide the theoretically optimal solution to build high-radix switches. Dynamically reconfiguring a three-stage Clos network is more difficult in asynchronous circuits than in synchronous circuits. This paper proposes a novel asynchronous dispatching (AD) algorithm for general three-stage Clos networks. It is compared with the classic synchronous concurrent round-robin dispatchin...

متن کامل

A Performance Study of Parallel FFT in Clos and Mesh Networks

Though it is known that clos interconnection networks have many advantages over the other interconnection networks, it would be interesting to see the performance benefits that clos networks can bring to the real world applications. In this paper, we compare the performance of Fast Fourier Transforms (FFT) in clos networks with that of in mesh networks, a popular interconnection topology. We us...

متن کامل

Design and Simulation of Output Queuing with the Middle Stage Buffered (OQMB) Clos Packet Switching Network

Clos network, a family of multistage networks, are attractive alternative for constructing scalable packet switches because of its distributed and modular design. The clos packet switching networks are the next step in scaling current crossbar switches to large number of ports. This paper presents the design and simulation of buffer lessbuffered-buffered Clos Packet switching network architectu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Annales des Télécommunications

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2002